The no-threat equilibrium in tournament games

نویسنده

  • Ruben Juarez
چکیده

Agents form coalitions with other agents. The coalition that forms with the largest power wins the tournament. A partition of the agents is a no threat equilibrium (NTE) if whenever a group of agents gains by forming their own coalition, there exist another group of agents that gains by forming their own coalition and harms at least one agent who initially deviated from the partition. We characterize the class of preferences over group of agents that guarantees the existence of a NTE partition. This class includes group of connected agents in networks without cycles, among others. ∗University of Hawaii, Department of Economics, 2424 Maile Way, Saunders Hall 542, Honolulu, HI 96822. E-mail: [email protected], Ph: (808) 956-7143. Financial Support from the AFOSR Young Investigator Program is greatly appreciated.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Tournament-Based Comparison of Learning and Non-Learning Algorithms for Iterated Games

Evolutionary tournaments have been used effectively as a tool for comparing game-playing algorithms. For instance, in the late 1970's, Axelrod organized tournaments to compare algorithms for playing the iterated prisoner's dilemma (PD) game. These tournaments capture the dynamics in a population of agents that periodically adopt relatively successful algorithms in the environment. While these t...

متن کامل

Computing Equilibria in Multiplayer Stochastic Games of Imperfect Information

Computing a Nash equilibrium in multiplayer stochastic games is a notoriously difficult problem. Prior algorithms have been proven to converge in extremely limited settings and have only been tested on small problems. In contrast, we recently presented an algorithm for computing approximate jam/fold equilibrium strategies in a three-player nolimit Texas hold’em tournament—a very large realworld...

متن کامل

Structural Estimation of Rank-order Tournament Games with Private Information

In this article we propose and solve a game-theoretic model of a rank-order tournament with private information. Using the contract settlement data from a poultry company, we estimate a fully structural model of a symmetric Nash equilibrium of this game. We show that growers’ equilibrium effort depends on four factors: the spread in piece rates between the performance brackets, the number of pl...

متن کامل

Computing Possible and Necessary Equilibrium Actions (and Bipartisan Set Winners)

In many multiagent environments, a designer has some, but limited control over the game being played. In this paper, we formalize this by considering incompletely specified games, in which some entries of the payoff matrices can be chosen from a specified set. We show that it is NP-hard for the designer to make this choices optimally, even in zero-sum games. In fact, it is already intractable t...

متن کامل

Nash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs

In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013